Quorum-Based Multi-Invocation Model for Replicated Objects

نویسندگان

  • Tomoya Enokido
  • Kenichi Hori
  • Michel Raynal
  • Makoto Takizawa
چکیده

In distributed systems, resources like databases are abstracted to be objects in order to increase the interoperability. Objects are replicated to make a system more reliable and available. In object-based systems, methods are invoked in a nested manner, i.e. methodsnamed invokees are invoked in another method named invoker. How to invoke methods on multiple replicas in the nested manner is discussed here. In this paper, methods are invoked on a quorum number of replicas of objects. Suppose each instance of a method t on multiple replicas of an object x invokes a method u on replicas in a quorum of another object y. Here, the method u is redundantly invoked, i.e. the same method is invoked many times on some replicas of the object y. This is redundant invocation. If each instance of the invoker method t invokes a method u on replicas in its own quorum of the object y, more number of replicas are manipulated by the method u than the quorum number. This is quorum expansion. A quorum-based multi-invocation (QMI) protocol is discussed where each of the multiple invokers invokes a method on the multiple replicas, and each of the invokee methods sends a response to multiple invokers without redundant invocation and quorum expansion. In addition, responses of the method are also sent to a quorum number of invokers. Even if some numbers of invoker and invokee replicas are faulty, every method can be surely performed on at least one operational replica, every operational invokee replica can receive at least one method request, and every operational invoker replica can receive at least one response. The QMI protocol is evaluated on how many replicas are manipulated and requests are issued in the presence of replica faults compared with the traditional primary–secondary replication.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quorum-Based Locking Protocol for Replicas in Object-Based Systems

W e discuss how to lock replicated objects by extending the quorum concept and perform methods o n replicas in a nested invocation. Each method i s issued to a quorum. If a pair of methods are compatible, their quorums may not intersect in our protocol even i f one of the methods is an update type. If a method t is invoked o n multiple replicas and each instance of t invokes another update meth...

متن کامل

Invocation Support for Replicated Objects

Most object-based distributed systems do not support replicated objects. Replication is crucial because it is the only means to tolerate partial failures in distributed systems. The key issue for replicated objects is an appropriate invocation support. An object O1 must invoke an object O2 always in the same fashion regardless of their own replication policies. This paper investigates the suppo...

متن کامل

Filtering Duplicated Invocations Using Symmetric Proxies

Invocation is the communication paradigm of objects. It is asymmetric by deenition: the invoker initiates the invocation whereas the invokee reacts to it. A proxy is a local representative of the invokee on the invoker's machine. Like the invocation, the proxy notion is asymmetric. However, when replicated objects are considered, there is a need for symmetric proxies: a regular proxy plus an in...

متن کامل

ROI: An Invocation Mechanism for Replicated Objects

The reliable object invocation mechanism provided by HIDRA for the coordinator-cohort and the passive replication models offers support to ensure that all the replicas of the object being invoked are correctly updated before such an invocation is terminated. This mechanism also ensures that if a primary or coordinator replica crashes, the client is able to reconnect to the previously initiated ...

متن کامل

Reducing Storage for Quorum Consensus Algorithms

In this paper, we first develop a fragmentation method that reduces the storage overhead of replicated objects. We then present a data management protocol for these fragmented objects, and show that this protocol is a generalisation of quorum consensus algorithms for replicated data in which objects are not fragmented. Although this protocol reduces storage requirements, it does not achieve the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Concurrent Engineering: R&A

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2004